Cluster Points of Subsequences

ثبت نشده
چکیده

In the preceding paper [ l ] 2 Buck defines a class of "subsequences" of a multiple sequence and shows that "almost all" of such subsequences have certain properties. This note is essentially based on a different choice of the definition of "subsequences" ; that is, this paper and [ l ] are generalizations in different directions of a preceding paper by Buck and Pollard (reference 2 of [l ]). In this discussion countability is the important property of the index systems such as the integers underlying the simple sequences or the ^-tuples of integers underlying the multiple sequences. Countability is a slightly stronger condition than is necessary since the results will be shown to hold as well for functions of n variables as for multiple sequences ; some other special cases are mentioned at the end of this paper. Also I modify Buck's approach by considering cluster points in neighborhood spaces rather than limit points in convergence spaces [3]. It may be mentioned that even for multiple sequences Theorems 1 and 2 of these papers are independent since Buck's set of "subsequences" is a set of measure zero in the set of "subsequences" considered here; my Theorem 3 contains the corresponding theorem of [ l ] as a special case. Lemma 1 and its corollary, Lemma 3, are the fundamental results on which the theorems rest ; Lemma 3 is the generalization appropriate to this paper of the lemma in §3 of [ l ] .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Density-based Clustering of Time Series Subsequences

Doubts have been raised that time series subsequences can be clustered in a meaningful way. This paper introduces a kernel-density-based algorithm that detects meaningful patterns in the presence of a vast number of random-walk-like subsequences. The value of density-based algorithms for noise elimination in general has long been demonstrated. The challenge of applying such techniques to time-s...

متن کامل

Predictability of sequences and subsequences with spectrum degeneracy at periodically located points

The paper established sufficient conditions of predictability with degeneracy for the spectrum at M periodically located isolated points on the unit circle. It is also shown that m-periodic subsequences of these sequences are also predictable if m is a divisor of M . The predictability can be achieved for finite horizon with linear predictors defined by convolutions with certain kernels. As an ...

متن کامل

Incremental Algorithm for Discovering Frequent Subsequences in Multiple Data Streams

In recent years, new applications emerged that produce data streams, such as stock data and sensor networks. Therefore, finding frequent subsequences, or clusters of subsequences, in data streams is an essential task in data mining. Data streams are continuous in nature, unbounded in size and have a high arrival rate. Due to these characteristics, traditional clustering algorithms fail to effec...

متن کامل

Preventing Meaningless Stock Time Series Pattern Discovery by Changing Perceptually Important Point Detection

Discovery of interesting or frequently appearing time series patterns is one of the important tasks in various time series data mining applications. However, recent research criticized that discovering subsequence patterns in time series using clustering approaches is meaningless. It is due to the presence of trivial matched subsequences in the formation of the time series subsequences using sl...

متن کامل

Mining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM

Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007